Location:
Search - Group 3 F
Search list
Description: 1.功能
利用广义逆求解无约束条件下的优化问题(C语言)
2.参数说明
int m : 非线性方程组中方程个数
int n : 非线性方程组中未知数个数
double eps1 : 控制最小二乘解的精度要求
double eps2 : 用于奇异值分解中的控制精度要求
double x[n] : 存放非线性方程组解的初始近似值X(0),要求各分量不全为0
int ka : Ka＝max{m,n}+1
void (*f)() : 指向计算非线性方程组中各方程左端函数值的函数名(用户自编)
void (*s)() : 指向计算雅可比矩阵的函数名
int ngin() : 函数返回一个标志值
3.文件说明
ngin.c函数文件
ngin0.c主函数文件-1. Using generalized inverse function for non-binding under the conditions of optimization problems (C) 2. Parameter Description int m : nonlinear equation group number int n equation : nonlinear equations were unknown number of double eps1 : Least Squares Solutions of control precision double eps2 : for the singular value decomposition of the control precision double x [n] : Nonlinear storage solutions of equations initial approximation of X (0), the requirements for the component failure 0 int ka : Ka = max (m, n) a void (* f) () : Calculation of nonlinear equations at the Group of the equation extreme value of the function name (user self) void (* s) () : at the Jacobian matrix calculation of the function name ngin int () : function returns a value of three signs. This document explains
Platform: |
Size: 2396 |
Author: 罗坤 |
Hits:
Description: 速度非常块，效果接近blsgsm。堪称去噪的又一突破。
OWT SURE-LET SOFTWARE FOR MATLAB
********************************
Florian Luisier, Thierry Blu and Michael Unser
Biomedical Imaging group
Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland.
March 2007
This software implements the algorithm described in:
[1] F. Luisier, T. Blu, M. Unser, \"A New SURE Approach to Image
Denoising: Interscale Orthonormal Wavelet Thresholding,\"
IEEE Transactions on Image Processing, vol. 16, no. 3, pp. 593-606,
March 2007.
Platform: |
Size: 2621631 |
Author: li |
Hits:
Description: fax group 3说明-fax group 3 Description
Platform: |
Size: 5120 |
Author: 站长 |
Hits:
Description: 1.功能
利用广义逆求解无约束条件下的优化问题(C语言)
2.参数说明
int m : 非线性方程组中方程个数
int n : 非线性方程组中未知数个数
double eps1 : 控制最小二乘解的精度要求
double eps2 : 用于奇异值分解中的控制精度要求
double x[n] : 存放非线性方程组解的初始近似值X(0),要求各分量不全为0
int ka : Ka＝max{m,n}+1
void (*f)() : 指向计算非线性方程组中各方程左端函数值的函数名(用户自编)
void (*s)() : 指向计算雅可比矩阵的函数名
int ngin() : 函数返回一个标志值
3.文件说明
ngin.c函数文件
ngin0.c主函数文件-1. Using generalized inverse function for non-binding under the conditions of optimization problems (C) 2. Parameter Description int m : nonlinear equation group number int n equation : nonlinear equations were unknown number of double eps1 : Least Squares Solutions of control precision double eps2 : for the singular value decomposition of the control precision double x [n] : Nonlinear storage solutions of equations initial approximation of X (0), the requirements for the component failure 0 int ka : Ka = max (m, n) a void (* f) () : Calculation of nonlinear equations at the Group of the equation extreme value of the function name (user self) void (* s) () : at the Jacobian matrix calculation of the function name ngin int () : function returns a value of three signs. This document explains
Platform: |
Size: 2048 |
Author: 罗坤 |
Hits:
Description: 速度非常块，效果接近blsgsm。堪称去噪的又一突破。
OWT SURE-LET SOFTWARE FOR MATLAB
********************************
Florian Luisier, Thierry Blu and Michael Unser
Biomedical Imaging group
Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland.
March 2007
This software implements the algorithm described in:
[1] F. Luisier, T. Blu, M. Unser, "A New SURE Approach to Image
Denoising: Interscale Orthonormal Wavelet Thresholding,"
IEEE Transactions on Image Processing, vol. 16, no. 3, pp. 593-606,
March 2007.
-Very block, the effect close to blsgsm. Denoising can be another breakthrough. OWT SURE-LET SOFTWARE FOR MATLAB******************************** Florian Luisier, Thierry Blu and Michael UnserBiomedical Imaging group Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland.March 2007This software implements the algorithm described in: [1] F. Luisier, T. Blu, M. Unser,
Platform: |
Size: 2621440 |
Author: li |
Hits:
Description: 1.本程序拟已知驻波比系数ρ，波节点的距离l_m_i_n，和频率f的情况下，求解归一化阻抗Z~，
所以在本程序运行时，要首先输入正确的驻波比系数ρ，波节点的距离l_m_i_n，和频率f；
2.本程序由于视野有限，课本后面的那个圆图并未全部显示出来，只是显示了本程序有用的部分
3.编制本程序的小组成员为微波技术实验分组，倪庆等；
4.由于时间原因，未能打成exe可执行文件包；
5.由于圆图信息量大，所以运行后要把窗口最大化才能正常显示；
6.红色的圆点即为阻抗圆点；- 1. This procedure is known to be standing wave ratio coefficient ρ, nodal points, the distance l_m_i_n, and frequency f of the situation, solving the normalized impedance Z ~, so this program is running, we must first enter the correct standing wave than the coefficient of ρ, nodal points, the distance l_m_i_n, and frequency f 2. This procedure is limited because of vision, books that chart the back had not been fully displayed, but shows the useful part of this program 3. preparation of the program members of the group of microwave technology experiment for the group, Ni Qing, etc. 4. due to time reasons, not labeled as exe executable file package 5. As the chart informative, so running should maximize the window will be displayed properly 6. red dot dot shall impedance
Platform: |
Size: 3072 |
Author: 倪庆 |
Hits:
Description: 设每位同学自己的学号为n，采用遗传算法求解下面优化问题：
min f(x1,x2)=(4-2.1*x1^2+(x1^4)/3)*x1^2+x1*x2+(-4+4*x2^2)*x2^2+n-20111369
s.t. -3<x1<3 -2<x2<2
函数 为六峰值驼背函数（Six-hump Camel Back Function），要求如下：
（i）mesh()为Matlab中常用的画图函数，请查阅相关书籍或help，掌握mesh用法，画出 的三维图像；
（ii）用遗传算法工具箱求解该优化问题，给出求解结果，画出每代群体的最优适应度、适应度均值图像。
（iii）尝试至少一种提高求解效果的方法，并简单比较、分析。
-Set each student their own student number for n, using the genetic algorithm for solving the following optimization problem:
Min (x1, x2) = f (4-2.1* x1 ^ 2+ (x1 ^ 4)/(3)* x1 ^ 2* x2+ x1+ x2 ^ (4+ 4* 2)* x2 ^ 2+ n- 20111369
S.t.- 3 < x1 < 3-2 "x2" 2
Functions for Six peak hunchback (Six- hump Camel Back Function), the requirements are as follows:
(I) mesh () as that is commonly used in Matlab drawing function, or help please refer to the relevant books, to master the use mesh, draw the 3 d image
(ii) using genetic algorithm toolbox to solve the optimization problem, is given as a result, to draw the best fitness of each generation group, the mean fitness images.
(iii) to try at least a way to improve the effect of solution, and a simple comparison and analysis.
Platform: |
Size: 1024 |
Author: 天溟 |
Hits:
Description: 利用C\C++实现RSA算法的加、解密运算。
具体包括：
1）利用扩展的Euclid计算 a mod n 的乘法逆元；
2）Miller-Rabin素性测试算法对一个给定的大数进行测试；
3）实现的运算，并计算；
4）利用Euler定理手工计算，并与3）计算的结果对比；
5）实现RSA算法。并对 I LOVE NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS 加解密。说明：为了方便实现，分组可以小一点，比如两个字母一组。
字母及其数字编码 字母及其数字编码
空格 00 N 14
A 01 O 15
B 02 P 16
C 03 Q 17
D 04 R 18
E 05 S 19
F 06 T 20
G 07 U 21
H 08 V 22
I 09 W 23
J 10 X 24
K 11 Y 25
L 12 Z 26
M 13 -Use of C \ C++ implements the RSA algorithm encryption and decryption operations.
These include:
1) using the extended Euclid calculate a mod n multiplicative inverse
2) Miller-Rabin primality testing algorithm for a given test large numbers
3) to achieve the operation, and the calculation
4) the use of Euler Theorem manual calculation, and compared with the results of the calculation 3)
5) implement the RSA algorithm. And I LOVE NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS encryption and decryption. Description: In order to facilitate the achievement of the packet may be smaller, for example, a group of two letters.
Alphabet letters and their digital encoding and digital encoding
Spaces 00 N 14
A 01 O 15
B 02 P 16
C 03 Q 17
D 04 R 18
E 05 S 19
F 06 T 20
G 07 U 21
H 08 V 22
I 09 W 23
J 10 X 24
K 11 Y 25
Platform: |
Size: 1024 |
Author: 刘洋 |
Hits:
Description: 一、算法伪码：
1、初始化：
1.1每一个空间的点映射到二维窗格，每个空间的点分配唯一的二维窗格坐标。一个窗格只能有一个点。
1.2为每一只蚂蚁在二维窗格分配唯一的地址
（第一步需要注意的是：空间上点的位置和平面窗格上点的位置完全是两回事，空间上两个点的位置来计算两点之间的距离；而平面上点的位置，主要是用来确定半径为S的区域内的点，计算两个点的空间距离，进而计算群体相似度，最后通过群体相似度来计算拾起或者放下的概率）
2、迭代tmax次
3、所有的蚂蚁运动一次
4、产生一个0-1之间的随机数R
5、如果当前蚂蚁处于未负载状态，而且当前蚂蚁所在处的有点Oi
5.1、计算群体相似度f(Oi)和拾起概率Pp(Oi)
5.2、如果拾起概率Pp(Oi)》R
5.2.1、当前蚂蚁拾起点Oi（注意Oi在窗格中的位置是不断变动的）
5.3 5.2结束
6、如果条件5不成立，如果当前蚂蚁处于负载状态，持有点Oi，而且当前位置没有其他点
6.1计算群体相似度f(Oi)和放下概率Pd(Oi)
6.2如果放下概率Pd(Oi)》R
6.2.1放下节点Oi（注意点Oi在窗格中的位置是不断变动的）
6.3 6.2结束
7、5结束
8、当前蚂蚁移到邻近区域内的没有被其他蚂蚁占据的节点
9、所有的蚂蚁运动一次结束
10、迭代tmax次结束
-First, the algorithm pseudocode: 1. Initialization: 1.1 point each to the two-dimensional space mapping pane, the point of each space is assigned a unique two-dimensional coordinates of the pane. A pane of only one point. 1.2 for each ant is assigned a unique address in the two-dimensional pane (the first step should be noted: the location and position of plane points pane space is completely different points, two points on the spatial position is calculated distance between two points and the position of the point on the plane is mainly used to determine the radius of the dot area S within the space of two points to calculate the distance, and then calculate the similarity group, and finally through group similarity calculating pickup probability plays or put down) 2, iterative tmax 3 times, once all the ants motion 4, R 5 a generates a random number between 0 and 1, if the current state of the ant is unloaded, and the current location at the little ant Oi 5.1 calculating the similar
Platform: |
Size: 333824 |
Author: chensumin |
Hits: